A MESHING TECHNIQUE FOR de BRUIJN TORI
نویسندگان
چکیده
An (R, S; m, n)k-de Bruijn torus is a k-ary R × S toroidal array with the property that every k-ary m × n matrix appears exactly once contiguously on the torus. The torus is a generalization of de Bruijn cycles and has been extended to higher dimensions by many authors. The central question, asked by Chung, Diaconis, and Graham, is for which R, S, m, n, and k such tori exist. In this note we develop a notion of equivalence class de Bruijn cycles and we extend a technique of Iványi and Tóth. Combining these ideas we are able to construct the first examples in which R and S are not powers of k. We prove for all natural numbers s and t there is a (4st, 4st; 2, 2)2st-de Bruijn torus.
منابع مشابه
New Constructions for De Bruijn Tori
A De Bruijn torus is a periodic d−dimensional k−ary array such that each n1 × · · · × nd k−ary array appears exactly once with the same period. We describe two new methods of constructing such arrays. The first is a type of product that constructs a k1k2−ary torus from a k1−ary torus and a k2−ary torus. The second uses a decomposition of a d-dimensional torus to produce a d + 1 dimensional toru...
متن کاملEmbedding Cartesian Products of Graphs into de Bruijn Graphs
Integration of concepts for the parallelization of image processing algorithms into parallel compiler technology. Abstract Given a Cartesian product G = G 1 : : : G m (m 2) of nontrivial connected graphs G i and the n{dimensional base B de Bruijn graph D = D B (n), it is investigated whether or not G is a spanning subgraph of D. Special attention is given to graphs G 1 : : : G m which are relev...
متن کاملCartesian Products of Graphs as Subgraphs of De Bruijn Graphs of Dimension at Least Three
Given a Cartesian product G = GI x x G,, (m > 2) of nontrivial connected graphs G, and the base d, dimension D de Bruijn graph B(d,D), it is investigated under which conditions G is (or is not) a subgraph of B(d, D). We present a complete solution of this problem for the case D 3 4. For D = 3, we give partial results including a complete solution for the case that G is a torus, i.e., G is the C...
متن کاملMinimum Feedback Vertex Sets in Shuffle-based Interconnection Networks
Given a graph G, the problem is to construct a smallest subset S of vertices whose deletion results in an acyclic subgraph. The set S is called a minimum feedback vertex set for G. Tight upper and lower bounds on the cardinality of minimum feedback vertex sets have been obtained for some hypercube–like networks, such as meshes, tori, butterflies, cube-connected cycles and hypercubes. In this pa...
متن کاملEmbedding Cartesian Products of Graphs into De Bruijn Graphs Embedding Cartesian Products of Graphs into De Bruijn Graphs
(m 2) of nontrivial connected graphs G i and the n-dimensional base B de Bruijn graph D = D B (n), we investigate whether or not there exists a spanning subgraph of D which is isomorphic to G. We show that G is never a spanning subgraph of D when n is greater than three or when n equals three and m is greater than two. For n = 3 and m = 2, we can show for wide classes of graphs that G cannot be...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1994